منابع مشابه
A numerical algorithm for solving a class of matrix equations
In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$ by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.
متن کاملSymmetric matrix polynomial equations
For problems of linear control system synthesis, an apparatus of polynomial equations (for single-variable case) and of matrix polynomial equations (for multivariable case) was successfully developed in recent times, cf. [1]. In connection with quadratic criteria, we are led to equations of special type, containing an operation of conjugation ah-* a* representing a(s) i-> a( — s) for continuous...
متن کاملa numerical algorithm for solving a class of matrix equations
in this paper, we present a numerical algorithm for solving matrix equations $(a otimes b)x = f$ by extending the well-known gaussian elimination for $ax = b$. the proposed algorithm has a high computational efficiency. two numerical examples are provided to show the effectiveness of the proposed algorithm.
متن کاملOn the distance from a matrix polynomial to matrix polynomials with two prescribed eigenvalues
Consider an n × <span style="fon...
متن کاملLimit Cycles of a Class of Generalized Liénard Polynomial Equations
In this paper we study the maximum number of limit cycles of the following generalized Liénard polynomial differential system of the first order ẋ = y2p−1 ẏ = −x2q−1 − εf (x, y) where p and q are positive integers, ε is a small parameter and f (x, y) is a polynomial of degree m. We prove that this maximum number depends on p, q and m. AMS subject classification:
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2013
ISSN: 0024-3795
DOI: 10.1016/j.laa.2012.08.020